Slow convergence of sequences of linear operators I: Almost arbitrarily slow convergence

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Arbitrarily Slow Rates of Global Convergence in Density Estimation

Assume that one has to estimate a density f on R e from X1, ..., Xn, a sequence of independent random vectors with common density f A density estimate is a sequence (f,) of Borel measurable mappings: R a ( n + ~ R ; for fixed n, f (x) is estimated by f,~(x)=f,(x, X 1 . . . . , X,). In this note, we take a look at the rate of convergence of E(~ ]f , (x)f (x) lPdx) ( p > l ) for all density estim...

متن کامل

Characterizing arbitrarily slow convergence in the method of alternating projections

Bauschke, Borwein, and Lewis have stated a trichotomy theorem [4, Theorem 5.7.16] that characterizes when the convergence of the method of alternating projections can be arbitrarily slow. However, there are two errors in their proof of this theorem. In this note, we show that although one of the errors is critical, the theorem itself is correct. We give a different proof that uses the multiplic...

متن کامل

$mathcal{I}_2$-convergence of double sequences of\ fuzzy numbers

In this paper, we introduce and study the concepts of $mathcal{I}_2$-convergence, $mathcal{I}_2^{*}$-convergence for double sequences of fuzzy real numbers, where $mathcal{I}_2$ denotes the ideal of subsets of $mathbb N times mathbb N$. Also, we study some properties and relations of them.

متن کامل

Slow Beatty Sequences, Devious Convergence, and Partitional Divergence

Sequences ( nr ) for 0 < r < 1 are introduced as slow Beatty sequences. They and ordinary Beatty sequences (for which r > 1) provide examples of sequences that converge deviously (which at first might seem to diverge), as well as partitionally divergent sequences (which consist of convergent subsequences).

متن کامل

Slow Convergence in Bootstrap Percolation

In the bootstrap percolation model, sites in an L by L square are initially infected independently with probability p. At subsequent steps, a healthy site becomes infected if it has at least 2 infected neighbours. As (L, p) → (∞, 0), the probability that the entire square is eventually infected is known to undergo a phase transition in the parameter p log L, occurring asymptotically at λ = π2/1...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 2010

ISSN: 0021-9045

DOI: 10.1016/j.jat.2010.05.001